Configuration equivalence is not equivalent to isomorphism
نویسندگان
چکیده
منابع مشابه
Graph Isomorphism is not AC reducible to Group Isomorphism
We give a new upper bound for the Group and Quasigroup Isomorphism problems when the input structures are given explicitly by multiplication tables. We show that these problems can be computed by polynomial size nondeterministic circuits of unbounded fan-in with O(log log n) depth and O(log n) nondeterministic bits, where n is the number of group elements. This improves the existing upper bound...
متن کاملHomeomorphism of 2-Complexes is Equivalent to Graph Isomorphism
Whittlesey 12,13,14] gave a criterion which decides when two nite 2-dimensional complexes are homeomorphic. We show that graph isomorphism can be reduced eeciently to 2-complex homeomorphism, and that Whittlesey's criterion can be reduced eeciently to graph isomorphism. Therefore graph isomorphism and 2-complex homeomorphism are polynomial-time equivalent.
متن کاملElementary equivalence versus Isomorphism
1) The isomorphy type of a finite field K is given by its cardinality |K|, i.e., if K and L are such fields, then K ∼= L iff |K| = |L|. 1) The isomorphy type of an algebraically closed field K is determined by two invariants: (i) Absolute transcendence degree td(K), (ii) The characteristic p = char(K) ≥ 0. In other words, if K and L are algebraically closed fields, then K ∼= L iff td(K) = td(L)...
متن کاملNonlinear Autoassociation Is Not Equivalent to PCA
A common misperception within the neural network community is that even with nonlinearities in their hidden layer, autoassociators trained with backpropagation are equivalent to linear methods such as principal component analysis (PCA). Our purpose is to demonstrate that nonlinear autoassociators actually behave differently from linear methods and that they can outperform these methods when use...
متن کاملA Term Equality Problem Equivalent to Graph Isomorphism
We demonstrate that deciding if two terms containing otherwise uninter-preted associative, commutative, and associative-commutative function symbols and commutative variable-binding operators are equal is polynomially equivalent to determining if two graphs are isomorphic. The reductions we use provide insight into this result and suggest polynomial time special cases.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Algebra and Computation
سال: 2017
ISSN: 0218-1967,1793-6500
DOI: 10.1142/s0218196717500503